package com.stanley.alogrithm.dynamic;

public class StockMaxProfit {
    public int maxProfit(int[] prices) {
        if (prices == null || prices.length < 2) {
            return 0;
        }
        if (prices.length == 2) {
            return prices[0] < prices[1] ? prices[1] - prices[0] : 0;
        }
        int maxProfit = 0;
        int i = 0; // buy index
        int j = 0; // sell index;
        //for (i = 0; i < prices.length)
        return 0;
    }
}
